The Methodology of Parallel Memetic Algorithms Designing
نویسندگان
چکیده
The paper presents the methodology of parallel algorithm designing based on the memetic approach (Lamarck and Baldwin evolution theory) making use of specific properties of the problem and distributed island model. This approach is presented on the example of the single machine scheduling problem with earliness/tardiness
منابع مشابه
A comparison of algorithms for minimizing the sum of earliness and tardiness in hybrid flow-shop scheduling problem with unrelated parallel machines and sequence-dependent setup times
In this paper, the flow-shop scheduling problem with unrelated parallel machines at each stage as well as sequence-dependent setup times under minimization of the sum of earliness and tardiness are studied. The processing times, setup times and due-dates are known in advance. To solve the problem, we introduce a hybrid memetic algorithm as well as a particle swarm optimization algorithm combine...
متن کاملGenetic and Memetic Algorithms for Sequencing a New JIT Mixed-Model Assembly Line
This paper presents a new mathematical programming model for the bi-criteria mixed-model assembly line balancing problem in a just-in-time (JIT) production system. There is a set of criteria to judge sequences of the product mix in terms of the effective utilization of the system. The primary goal of this model is to minimize the setup cost and the stoppage assembly line cost, simultaneously. B...
متن کاملReliability Modelling of the Redundancy Allocation Problem in the Series-parallel Systems and Determining the System Optimal Parameters
Considering the increasingly high attention to quality, promoting the reliability of products during designing process has gained significant importance. In this study, we consider one of the current models of the reliability science and propose a non-linear programming model for redundancy allocation in the series-parallel systems according to the redundancy strategy and considering the assump...
متن کاملThe Design of Memetic Algorithms for Scheduling and Timetabling Problems
There are several characteristics that make scheduling and timetabling problems particularly difficult to solve: they have huge search spaces, they are often highly constrained, they require sophisticated solution representation schemes, and they usually require very time-consuming fitness evaluation routines. There is a considerable number of memetic algorithms that have been proposed in the l...
متن کاملSOLVING A STEP FIXED CHARGE TRANSPORTATION PROBLEM BY A SPANNING TREE-BASED MEMETIC ALGORITHM
In this paper, we consider the step fixed-charge transportation problem (FCTP) in which a step fixed cost, sometimes called a setup cost, is incurred if another related variable assumes a nonzero value. In order to solve the problem, two metaheuristic, a spanning tree-based genetic algorithm (GA) and a spanning tree-based memetic algorithm (MA), are developed for this NP-hard problem. For compa...
متن کامل